Word maps with constants on symmetric groups
نویسندگان
چکیده
Abstract We study word maps with constants on symmetric groups. Even though there are non‐trivial mixed identities of bounded length that valid for all groups, we show no such can hold in the limit a metric sense. Moreover, prove and content, short enough, have an image positive diameter, measured normalized Hamming metric, which is from below terms length. Finally, also every self‐map finite non‐abelian simple group actually map G .
منابع مشابه
Word Maps, Word Maps with Constants and Representation Varieties of One-relator Groups
by evaluation. Namely, w̃(g1, . . . , gm) is obtained by substituting gi in place of xi and g −1 i in place of x−1 i followed by computing the resulting value w(g1, . . . , gm). Word maps have been intensely studied over at least two past decades in various contexts (see, e.g., [?], [?], [?], [?] for surveys). In this paper, we consider the case where G = G(K) is the group of K-points of a simpl...
متن کاملSeshadri Constants on Symmetric Products of Curves
Let Xg = C (2) g be the second symmetric product of a very general curve of genus g. We reduce the problem of describing the ample cone on Xg to a problem involving the Seshadri constant of a point on Xg−1. Using this we recover a result of Ciliberto-Kouvidakis that reduces finding the ample cone of Xg to the Nagata conjecture when g ≥ 9. We also give new bounds on the the ample cone of Xg when...
متن کاملImages of Word Maps in Finite Simple Groups
In response to questions by Kassabov, Nikolov and Shalev, we show that a given subset A of a finite simple group G is the image of some word map w : G×G → G if and only if (i) A contains the identity and (ii) A is invariant under Aut(G).
متن کاملhomogenous finitary symmetric groups
we characterize strictly diagonal type of embeddings offinitary symmetric groups in terms of cardinality and the characteristic. namely, we prove thefollowing.let $kappa$ be an infinite cardinal. if$g=underset{i=1}{stackrel{infty}bigcup} g_i,$ where $ g_i=fsym(kappa n_i)$,$(h=underset{i=1}{stackrel{infty}bigcup}h_i, $ where $ h_i=alt(kappa n_i) ), $ is a group of strictly diagonal type and$xi=(...
متن کاملWord Problem on Hyperbolic Groups
Hyperbolic groups are introduced as a class of groups for which there exists an algorithm to solve the word problem. The paper defines hyperbolic group, proves that they satisfy the conditions needed to apply Dehn’s algorithm, and finishes by describing the algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2023
ISSN: ['1522-2616', '0025-584X']
DOI: https://doi.org/10.1002/mana.202300152